Best-Effort Versus Reservations Revisited
نویسندگان
چکیده
In this paper, we walk in the footsteps of the stimulating paper by Lee Breslau and Scott Shenker entitled “Best-effort vs. Reservations: A Simple Comparative Analysis”[1]. In fact, we finally follow their invitation to use their models as a starting point and extend them to reason about the very basic but still very much debated architectural issue whether quality of service (QoS) mechanisms like admission control and service differentiation are necessary or if overprovisioning with a single service class does the job just as well at lower system complexity. We analytically compare two QoS systems: a QoS system using admission control and a reservation mechanism that can guarantee bandwidth for flows respectively offers service differentiation based on priority queueing for two service classes and a system with no admission control and a single best-effort service class.
منابع مشابه
A QoS-Sensitive MAC for Slotted WDM Metropolitan Rings
Traffic segregation is essential in shared medium systems to allow best-effort traffic to coexist with delay-sensitive traffic without the former disturbing the QoS of the latter. Rigid allocation per traffic class is very inefficient so a dynamic method that exploits the elastic behaviour of best-effort traffic due to its closed loop control is essential for high system utilisation. A novel MA...
متن کاملA Router - Based Congestion Control Scheme For Real - Time Continuous Media ( Dissertation Proposal )
This dissertation focuses on supporting the real-time transmission of continuous media over heterogeneous networks. Resource reservation is an effective solution when a fully QOS-capable connection exists from sender to receiver but many networks can not support reservations. End-to-end adaptations offer good best-effort attempts on networks where reservations are not possible but either degrad...
متن کاملExtending a Best-Effort Operating System to Provide QoS Processor Management
The benefits of QoS network features are easily lost when the endnodes are managed by a conventional, best-effort operating system. Schedulers of such operating systems provide only rudimentary tools (like priority adjustment) for processor management. We present here a simple extension to a processor management system that allows an application to reserve a share of the processor for a specifi...
متن کاملTAMCRA: a tunable accuracy multiple constraints routing algorithm
$EVWUDFW Routing with more than one additive constraints is known to be an NP-complete problem, and hence considered as intractable. We present a new QoS routing algorithm, called Tunable Accuracy Multiple Constraints Routing algorithm (TAMCRA), which solves the problem in a fast and accurate way. Although the current internet is a best-effort network, serious efforts are spent to offer QoS and...
متن کاملAn edge router based protocol for fault tolerant handling of advance reservations
To provide quality of service guarantees, resource reservation schemes have to maintain reservation states at the nodes along the path of a flow. Advance reservation schemes have to maintain these states for a long period of time. The loss of reservation state caused by node failures, makes advance reservation schemes highly susceptible to node failures. In this paper, we argue that a domain-by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005